\hypertarget{triangulation_8c}{
\section{triangulation.c File Reference}
\label{triangulation_8c}\index{triangulation.c@{triangulation.c}}
}
{\tt \#include \char`\"{}triangulation.h\char`\"{}}\par
{\tt \#include $<$stdlib.h$>$}\par
{\tt \#include $<$stdio.h$>$}\par
\subsection*{Data Structures}
\begin{CompactItemize}
\item 
struct \hyperlink{struct__ListeAretes}{\_\-Liste\-Aretes}
\item 
struct \hyperlink{struct__ListeEtiquette}{\_\-Liste\-Etiquette}
\item 
struct \hyperlink{structEtiquetteTri}{Etiquette\-Tri}
\item 
struct \hyperlink{struct__GrapheEtiquetteTri}{\_\-Graphe\-Etiquette\-Tri}
\end{CompactItemize}
\subsection*{Typedefs}
\begin{CompactItemize}
\item 
typedef \hyperlink{struct__ListeAretes}{\_\-Liste\-Aretes} \hyperlink{triangulation_8c_e481a7c633786b35f4c5cfa6c09df9ed}{Liste\-Aretes}
\item 
typedef \hyperlink{struct__ListeEtiquette}{\_\-Liste\-Etiquette} \hyperlink{triangulation_8c_1b75834199a4cc2184d761e15ab00aed}{Liste\-Etiquette\-Tri}
\item 
typedef \hyperlink{struct__GrapheEtiquetteTri}{\_\-Graphe\-Etiquette\-Tri} \hyperlink{triangulation_8c_c42d144fc7d4b3f655668f6284189bf7}{Graphe\-Etiquette\-Tri}
\end{CompactItemize}
\subsection*{Functions}
\begin{CompactItemize}
\item 
void \hyperlink{triangulation_8c_3be08069fb1c4931b094e02e6a6a1a18}{libere\-Etiquette\-Tri} (\hyperlink{struct__GrapheEtiquetteTri}{Graphe\-Etiquette\-Tri} $\ast$Eti)
\item 
void \hyperlink{triangulation_8c_59c9652a5652a0ad2b631939b839f3a9}{init\-Etiquette\-Tri} (\hyperlink{struct__GrapheEtiquetteTri}{Graphe\-Etiquette\-Tri} $\ast$$\ast$Eti, int n)
\item 
void \hyperlink{triangulation_8c_70807ffbec7055d304c26a6f612a4275}{ajouter\-Etiquette\-Tri} (\hyperlink{struct__GrapheEtiquetteTri}{Graphe\-Etiquette\-Tri} $\ast$Eti, int sommet, int valeur)
\item 
void \hyperlink{triangulation_8c_fbc52830c531508f2c942e2220dd8f7a}{ajouter\-Arete} (\hyperlink{struct__ListeAretes}{Liste\-Aretes} $\ast$$\ast$l, int s1, int s2)
\item 
int \hyperlink{triangulation_8c_b6977c801d85aee724514da476b91c22}{est\-Inferieur} (\hyperlink{struct__GrapheEtiquetteTri}{Graphe\-Etiquette\-Tri} $\ast$Eti, int inf, int sup)
\item 
int \hyperlink{triangulation_8c_9af195c3fb0c1ecaeb9ba536b6a67bc7}{selection\-Sommet\-Maximum} (\hyperlink{struct__GrapheEtiquetteTri}{Graphe\-Etiquette\-Tri} $\ast$Eti, \hyperlink{structNumerotation}{Numerotation} $\ast$Num, int n)
\item 
int \hyperlink{triangulation_8c_2cb98b514b0c7847c55fc35c390fc188}{parcours\-Profondeur} (\hyperlink{structGraphe}{Graphe} $\ast$G, int $\ast$$\ast$marque, \hyperlink{struct__GrapheEtiquetteTri}{Graphe\-Etiquette\-Tri} $\ast$Eti, \hyperlink{structNumerotation}{Numerotation} $\ast$Num, int depart, int ajout\-Eti, int arrivee)
\item 
void \hyperlink{triangulation_8c_cdc3bf1b0059458f49257705bc792f02}{ajouter\-Arete\-Manquantes} (\hyperlink{struct__ListeAretes}{Liste\-Aretes} $\ast$$\ast$L, \hyperlink{structGraphe}{Graphe} $\ast$G, \hyperlink{struct__GrapheEtiquetteTri}{Graphe\-Etiquette\-Tri} $\ast$Eti, \hyperlink{structNumerotation}{Numerotation} $\ast$Num, int depart, int ajout\-Eti, int arrivee, int $\ast$nb\-Aretes)
\item 
int \hyperlink{triangulation_8c_a04f8ece38fc315e7133875593523136}{triangulation\-Minimale} (\hyperlink{structGraphe}{Graphe} G)
\begin{CompactList}\small\item\em Cacul une triangulation minimale d'un graphe.. \item\end{CompactList}\end{CompactItemize}


\subsection{Typedef Documentation}
\hypertarget{triangulation_8c_c42d144fc7d4b3f655668f6284189bf7}{
\index{triangulation.c@{triangulation.c}!GrapheEtiquetteTri@{GrapheEtiquetteTri}}
\index{GrapheEtiquetteTri@{GrapheEtiquetteTri}!triangulation.c@{triangulation.c}}
\subsubsection[GrapheEtiquetteTri]{\setlength{\rightskip}{0pt plus 5cm}typedef struct \hyperlink{struct__GrapheEtiquetteTri}{\_\-Graphe\-Etiquette\-Tri} \hyperlink{struct__GrapheEtiquetteTri}{Graphe\-Etiquette\-Tri}}}
\label{triangulation_8c_c42d144fc7d4b3f655668f6284189bf7}


\hypertarget{triangulation_8c_e481a7c633786b35f4c5cfa6c09df9ed}{
\index{triangulation.c@{triangulation.c}!ListeAretes@{ListeAretes}}
\index{ListeAretes@{ListeAretes}!triangulation.c@{triangulation.c}}
\subsubsection[ListeAretes]{\setlength{\rightskip}{0pt plus 5cm}typedef struct \hyperlink{struct__ListeAretes}{\_\-Liste\-Aretes} \hyperlink{struct__ListeAretes}{Liste\-Aretes}}}
\label{triangulation_8c_e481a7c633786b35f4c5cfa6c09df9ed}


\hypertarget{triangulation_8c_1b75834199a4cc2184d761e15ab00aed}{
\index{triangulation.c@{triangulation.c}!ListeEtiquetteTri@{ListeEtiquetteTri}}
\index{ListeEtiquetteTri@{ListeEtiquetteTri}!triangulation.c@{triangulation.c}}
\subsubsection[ListeEtiquetteTri]{\setlength{\rightskip}{0pt plus 5cm}typedef struct \hyperlink{struct__ListeEtiquette}{\_\-Liste\-Etiquette} \hyperlink{struct__ListeEtiquette}{Liste\-Etiquette\-Tri}}}
\label{triangulation_8c_1b75834199a4cc2184d761e15ab00aed}




\subsection{Function Documentation}
\hypertarget{triangulation_8c_fbc52830c531508f2c942e2220dd8f7a}{
\index{triangulation.c@{triangulation.c}!ajouterArete@{ajouterArete}}
\index{ajouterArete@{ajouterArete}!triangulation.c@{triangulation.c}}
\subsubsection[ajouterArete]{\setlength{\rightskip}{0pt plus 5cm}void ajouter\-Arete (\hyperlink{struct__ListeAretes}{Liste\-Aretes} $\ast$$\ast$ {\em l}, int {\em s1}, int {\em s2})}}
\label{triangulation_8c_fbc52830c531508f2c942e2220dd8f7a}




Definition at line 109 of file triangulation.c.

Referenced by ajouter\-Arete\-Manquantes().\hypertarget{triangulation_8c_cdc3bf1b0059458f49257705bc792f02}{
\index{triangulation.c@{triangulation.c}!ajouterAreteManquantes@{ajouterAreteManquantes}}
\index{ajouterAreteManquantes@{ajouterAreteManquantes}!triangulation.c@{triangulation.c}}
\subsubsection[ajouterAreteManquantes]{\setlength{\rightskip}{0pt plus 5cm}void ajouter\-Arete\-Manquantes (\hyperlink{struct__ListeAretes}{Liste\-Aretes} $\ast$$\ast$ {\em L}, \hyperlink{structGraphe}{Graphe} $\ast$ {\em G}, \hyperlink{struct__GrapheEtiquetteTri}{Graphe\-Etiquette\-Tri} $\ast$ {\em Eti}, \hyperlink{structNumerotation}{Numerotation} $\ast$ {\em Num}, int {\em depart}, int {\em ajout\-Eti}, int {\em arrivee}, int $\ast$ {\em nb\-Aretes})}}
\label{triangulation_8c_cdc3bf1b0059458f49257705bc792f02}




Definition at line 207 of file triangulation.c.

References ajouter\-Arete(), ajouter\-Etiquette\-Tri(), ajouter\-Liste, \_\-Maillon::elt, est\-Inferieur(), FOREACH, Graphe::nb\-Sommets, parcours\-Profondeur(), Numerotation::Sommet, and Graphe::Sommets.

Referenced by triangulation\-Minimale().\hypertarget{triangulation_8c_70807ffbec7055d304c26a6f612a4275}{
\index{triangulation.c@{triangulation.c}!ajouterEtiquetteTri@{ajouterEtiquetteTri}}
\index{ajouterEtiquetteTri@{ajouterEtiquetteTri}!triangulation.c@{triangulation.c}}
\subsubsection[ajouterEtiquetteTri]{\setlength{\rightskip}{0pt plus 5cm}void ajouter\-Etiquette\-Tri (\hyperlink{struct__GrapheEtiquetteTri}{Graphe\-Etiquette\-Tri} $\ast$ {\em Eti}, int {\em sommet}, int {\em valeur})}}
\label{triangulation_8c_70807ffbec7055d304c26a6f612a4275}




Definition at line 57 of file triangulation.c.

References \_\-Liste\-Etiquette::eti, \_\-Graphe\-Etiquette\-Tri::eti, Etiquette\-Tri::liste, Etiquette\-Tri::nb, and \_\-Liste\-Etiquette::suivant.

Referenced by ajouter\-Arete\-Manquantes().\hypertarget{triangulation_8c_b6977c801d85aee724514da476b91c22}{
\index{triangulation.c@{triangulation.c}!estInferieur@{estInferieur}}
\index{estInferieur@{estInferieur}!triangulation.c@{triangulation.c}}
\subsubsection[estInferieur]{\setlength{\rightskip}{0pt plus 5cm}int est\-Inferieur (\hyperlink{struct__GrapheEtiquetteTri}{Graphe\-Etiquette\-Tri} $\ast$ {\em Eti}, int {\em inf}, int {\em sup})}}
\label{triangulation_8c_b6977c801d85aee724514da476b91c22}




Definition at line 120 of file triangulation.c.

References \_\-Liste\-Etiquette::eti, \_\-Graphe\-Etiquette\-Tri::eti, Etiquette\-Tri::liste, Etiquette\-Tri::nb, and \_\-Liste\-Etiquette::suivant.

Referenced by ajouter\-Arete\-Manquantes(), parcours\-Profondeur(), and selection\-Sommet\-Maximum().\hypertarget{triangulation_8c_59c9652a5652a0ad2b631939b839f3a9}{
\index{triangulation.c@{triangulation.c}!initEtiquetteTri@{initEtiquetteTri}}
\index{initEtiquetteTri@{initEtiquetteTri}!triangulation.c@{triangulation.c}}
\subsubsection[initEtiquetteTri]{\setlength{\rightskip}{0pt plus 5cm}void init\-Etiquette\-Tri (\hyperlink{struct__GrapheEtiquetteTri}{Graphe\-Etiquette\-Tri} $\ast$$\ast$ {\em Eti}, int {\em n})}}
\label{triangulation_8c_59c9652a5652a0ad2b631939b839f3a9}




Definition at line 43 of file triangulation.c.

Referenced by triangulation\-Minimale().\hypertarget{triangulation_8c_3be08069fb1c4931b094e02e6a6a1a18}{
\index{triangulation.c@{triangulation.c}!libereEtiquetteTri@{libereEtiquetteTri}}
\index{libereEtiquetteTri@{libereEtiquetteTri}!triangulation.c@{triangulation.c}}
\subsubsection[libereEtiquetteTri]{\setlength{\rightskip}{0pt plus 5cm}void libere\-Etiquette\-Tri (\hyperlink{struct__GrapheEtiquetteTri}{Graphe\-Etiquette\-Tri} $\ast$ {\em Eti})}}
\label{triangulation_8c_3be08069fb1c4931b094e02e6a6a1a18}




Definition at line 38 of file triangulation.c.\hypertarget{triangulation_8c_2cb98b514b0c7847c55fc35c390fc188}{
\index{triangulation.c@{triangulation.c}!parcoursProfondeur@{parcoursProfondeur}}
\index{parcoursProfondeur@{parcoursProfondeur}!triangulation.c@{triangulation.c}}
\subsubsection[parcoursProfondeur]{\setlength{\rightskip}{0pt plus 5cm}int parcours\-Profondeur (\hyperlink{structGraphe}{Graphe} $\ast$ {\em G}, int $\ast$$\ast$ {\em marque}, \hyperlink{struct__GrapheEtiquetteTri}{Graphe\-Etiquette\-Tri} $\ast$ {\em Eti}, \hyperlink{structNumerotation}{Numerotation} $\ast$ {\em Num}, int {\em depart}, int {\em ajout\-Eti}, int {\em arrivee})}}
\label{triangulation_8c_2cb98b514b0c7847c55fc35c390fc188}




Definition at line 185 of file triangulation.c.

References \_\-Maillon::elt, est\-Inferieur(), FOREACH, Numerotation::Sommet, and Graphe::Sommets.

Referenced by ajouter\-Arete\-Manquantes().\hypertarget{triangulation_8c_9af195c3fb0c1ecaeb9ba536b6a67bc7}{
\index{triangulation.c@{triangulation.c}!selectionSommetMaximum@{selectionSommetMaximum}}
\index{selectionSommetMaximum@{selectionSommetMaximum}!triangulation.c@{triangulation.c}}
\subsubsection[selectionSommetMaximum]{\setlength{\rightskip}{0pt plus 5cm}int selection\-Sommet\-Maximum (\hyperlink{struct__GrapheEtiquetteTri}{Graphe\-Etiquette\-Tri} $\ast$ {\em Eti}, \hyperlink{structNumerotation}{Numerotation} $\ast$ {\em Num}, int {\em n})}}
\label{triangulation_8c_9af195c3fb0c1ecaeb9ba536b6a67bc7}




Definition at line 164 of file triangulation.c.

References est\-Inferieur(), and Numerotation::Sommet.

Referenced by triangulation\-Minimale().\hypertarget{triangulation_8c_a04f8ece38fc315e7133875593523136}{
\index{triangulation.c@{triangulation.c}!triangulationMinimale@{triangulationMinimale}}
\index{triangulationMinimale@{triangulationMinimale}!triangulation.c@{triangulation.c}}
\subsubsection[triangulationMinimale]{\setlength{\rightskip}{0pt plus 5cm}int triangulation\-Minimale (\hyperlink{structGraphe}{Graphe} {\em G})}}
\label{triangulation_8c_a04f8ece38fc315e7133875593523136}


Cacul une triangulation minimale d'un graphe.. 

Entree un \hyperlink{structGraphe}{Graphe} G=(S, A), sortie un graphe G==(S,A u B) triangule \begin{Desc}
\item[Author:]Bourgeois Jean-Louis \end{Desc}
\begin{Desc}
\item[Parameters:]
\begin{description}
\item[{\em $\ast$G}]un pointeur sur un \hyperlink{structGraphe}{Graphe} \end{description}
\end{Desc}
\begin{Desc}
\item[Returns:]Le nombre d'aretes ajoutees pour trianguler G ( card(B) ) \end{Desc}


Definition at line 261 of file triangulation.c.

References ajouter\-Arete\-Manquantes(), init\-Etiquette\-Tri(), Graphe::nb\-Sommets, Numerotation::Numero, selection\-Sommet\-Maximum(), and Numerotation::Sommet.

Referenced by main().